Computation and Data Partitioning on Scalable Shared Memory Multiprocessors

نویسندگان

  • Sudarsan Tandri
  • Tarek S. Abdelrahman
چکیده

In this paper we identify the factors that affect the derivation of computation and data partitions on scalable shared memory multiprocessors (SSMMs). We show that these factors necessitate an SSMM-conscious approach. In addition to remote memory access, which is the sole factor on distributed memory multiprocessors, cache affinity, memory contention and false sharing are important factors that must be considered. Experimental evidence is presented to demonstrate the impact of these factors on performance using three applications on the KSR1 and the Hector multiprocessors.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Automatic Computation and Data Partitioning on Scalable

Scalable shared memory multiprocessors are becoming increasingly popular platforms for high-performance scienti c computing because they both scale to large numbers of processors and support the familiar shared memory abstraction. In order to improve application performance on these machines, it is essential to divide computation among processors and to place data carefully in the distributed s...

متن کامل

Automatic Partitioning of Data and Computations on Scalable Shared Memory Multiprocessors

This paper describes an algorithm for deriving data and computation partitions on scalable shared memory multiprocessors. The algorithm establishes affinity relationships between where computations are performed and where data is located based on array accesses in the program. The algorithm then uses these affinity relationships to determine both static and dynamic partitions for arrays and par...

متن کامل

Compile-lime Optimization of Near-Neighbor Communication for Scalable Shared-Memory Multiprocessors

Scalable shared-memory multiprocessor systems are typically NUMA (nonuniform memory access) machines, where the exploitation of the memory hierarchy is critical to achieving high performance. Iterative data parallel loops with near-neighbor communication account for many important numerical applications. In such loops, the communication of partial results stresses the memory system performance....

متن کامل

Automatic Data and Computation Partitioning on Scalable Shared Memory Multiprocessors

Scalable Shared Memory Multiprocessors (SSMMs) are becoming increasingly popular as platforms for parallel scientific computing. Recent commercial systems such as the Convex Exemplar and the Cray T3E offer not only scalability previously exclusive to distributed memory multiprocessors, but also the convenience of a single coherent view of memory. The presense of shared memory initially suggests...

متن کامل

Data Forwarding in Scalable Shared-Memory Multiprocessors1

Scalable shared-memory multiprocessors are often slowed down by long-latency memory accesses. One way to cope with this problem is to use data forwarding to overlap memory accesses with computation. With data forwarding, when a processor produces a datum, in addition to updating its cache, it sends a copy of the datum to the caches of the processors that the compiler identified as consumers of ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1995